Computational Analysis of Intelligent Agents: Social and Strategic Settings

نویسنده

  • Anshul Sawant
چکیده

Title of dissertation: COMPUTATIONAL ANALYSIS OF INTELLIGENT AGENTS: SOCIAL AND STRATEGIC SETTINGS Anshul Sawant, Doctor of Philosophy, 2016 Dissertation co-directed by: Prof. V.S. Subrahmanian, Department of Computer Science Prof. Mohammad Taghi. Hajiaghayi, Department of Computer Science The central motif of this work is prediction and optimization in presence of multiple interacting intelligent agents. We use the phrase ‘intelligent agents’ to imply in some sense, a ‘bounded rationality’, the exact meaning of which varies depending on the setting. Our agents may not be ‘rational’ in the classical game theoretic sense, in that they don’t always optimize a global objective. Rather, they rely on heuristics, as is natural for human agents or even software agents operating in the real-world. Within this broad framework we study the problem of influence maximization in social networks where behavior of agents is myopic, but complication stems from the structure of interaction networks. In this setting, we generalize two well-known models and give new algorithms and hardness results for our models. Then we move on to models where the agents reason strategically but are faced with considerable uncertainty. For such games, we give a new solution concept and analyze a real-world game using out techniques. Finally, the richest model we consider is that of Network Cournot Competition which deals with strategic resource allocation in hypergraphs, where agents reason strategically and their interaction is specified indirectly via player’s utility functions. For this model, we give the first equilibrium computability results. In all of the above problems, we assume that payoffs for the agents are known. However, for realworld games, getting the payoffs can be quite challenging. To this end, we also study the inverse problem of inferring payoffs, given game history. We propose and evaluate a data analytic framework and we show that it is fast and performant. COMPUTATIONAL ANALYSIS OF INTELLIGENT AGENTS: SOCIAL AND STRATEGIC SETTINGS

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Translating Agents' Actions to Strategic Measures: Agent-Based Modeling with Genetic Algorithms to Analyze Competing Companies

Agent-based simulation has become one of the promising gears for computational social sciences including business management strategy studies. This paper addresses a novel technology of agent-based modeling with genetic algorithms. Our method is characterized by (1) Decision making agents or competing companies with strategic parameters to be optimized; (2) A multiobjective optimization framewo...

متن کامل

Success, strategy and skill: an experimental study

In many AI settings an agent is comprised of both actionplanning and action-execution components. We examine the relationship between the precision of the execution component, the intelligence of the planning component, and the overall success of the agent. Our motivation lies in determining whether higher execution skill rewards more strategic playing. We present a computational billiards fram...

متن کامل

The Role of Implicit Motives in Strategic Decision-Making: Computational Models of Motivated Learning and the Evolution of Motivated Agents

Individual behavioral differences in humans have been linked to measurable differences in their mental activities, including differences in their implicit motives. In humans, individual differences in the strength of motives such as power, achievement and affiliation have been shown to have a significant impact on behavior in social dilemma games and during other kinds of strategic interactions...

متن کامل

Analysis of the Evolutionary Game Theory in Agent-Based Computational Systems: OPEC Oil-Producing Countries

This study suggests a new method for analysing the behavioral economics issues in the framework of game theory. In this context, bounded rational agents interact with one another in a strategic manner. Therefore, conventional economic modeling techniques are unable to explaine this kind of interactions. In this regard, evolutionary game theory and agent-based modeling are known as the most suit...

متن کامل

Computational Aspects of Preference Aggregation

In a preference aggregation setting, a group of agents must jointly make a decision, based on the individual agents’ privately known preferences. To do so, the agents need some protocol that will elicit this information from them, and make the decision. Examples include voting protocols, auctions, and exchanges. Mechanism design is the study of designing preference aggregation protocols in such...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016